A combinatorial proof of the Removal Lemma for Groups
نویسندگان
چکیده
Green [Geometric and Functional Analysis 15 (2005), 340–376] established a version of the Szemerédi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his Removal Lemma that allows us to extend its statement to all finite groups. We also discuss possible extensions of the Removal Lemma to systems of equations.
منابع مشابه
عدد تناوبی گراف‌ها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملFuzzy Linear Programming and its Application for a Constructive Proof of a Fuzzy Version of Farkas Lemma
The main aim of this paper is to deal with a fuzzy version of Farkas lemma involving trapezoidal fuzzy numbers. In turns to that the fuzzy linear programming and duality theory on these problems can be used to provide a constructive proof for Farkas lemma. Keywords Farkas Lemma, Fuzzy Linear Programming, Duality, Ranking Functions.
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملCombinatorial Aspects of Szemerédi ’ S Theorem
In the first section we review the beautiful combinatorial theory of Ramsey as well as the history of Szemerédi’s theorem. In Section 2 we give a sketch of Ruzsa’s modern proof of Freiman’s theorem on sumsets which plays an important role in Gowers’ quantitative proof of Szemerédi’s theorem. In the last section we deduce Roth’s theorem (Szemerédi’s theorem in the case k=3) from the Triangle Rem...
متن کاملAn Arithmetic Analogue of Fox's Triangle Removal Argument
We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group Fn 2 . A triangle in Fn 2 is a triple (x, y, z) such that x + y + z = 0. The triangle removal lemma for Fn 2 states that for every ε > 0 there is a δ > 0, such that if a subset A of Fn 2 requires the removal of at least ε · 2n elements to make it triangle-free, then it must contain at l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 116 شماره
صفحات -
تاریخ انتشار 2009